lazy functional language - definição. O que é lazy functional language. Significado, conceito
Diclib.com
Dicionário ChatGPT
Digite uma palavra ou frase em qualquer idioma 👆
Idioma:

Tradução e análise de palavras por inteligência artificial ChatGPT

Nesta página você pode obter uma análise detalhada de uma palavra ou frase, produzida usando a melhor tecnologia de inteligência artificial até o momento:

  • como a palavra é usada
  • frequência de uso
  • é usado com mais frequência na fala oral ou escrita
  • opções de tradução de palavras
  • exemplos de uso (várias frases com tradução)
  • etimologia

O que (quem) é lazy functional language - definição

PROGRAMMING LANGUAGE WHICH COMBINES FUNCTIONAL AND LOGIC PROGRAMMING TECHNIQUES
Algebraic logic functional programming language; Algebraic Logic Functional (programming language)

Lazy (Orlová)         
PART OF ORLOVÁ
Lazy (Orlova)
(Polish: ) is a village in Karviná District, Moravian-Silesian Region, Czech Republic. It was a separate municipality but became administratively a part of Orlová in 1946.
Lazy Susan         
  • Finnish]] carpenter Ikahainen.<ref>[http://www.russianmuseums.info/M267 Repin "Penaty" Estate in Repino/Kuokkala, Russia, currently a museum].</ref>
TURNTABLE PLACED ON A TABLE OR COUNTERTOP TO AID IN DISTRIBUTING FOOD
Lazy susan; Lazy Suzy; Cake turntable
A Lazy Susan is a turntable (rotating tray) placed on a table or countertop to aid in distributing food. Lazy Susans may be made from a variety of materials but are usually glass, wood, or plastic.
pure functional language         
PROGRAMMING PARADIGM THAT TREATS ALL COMPUTATION AS THE EVALUATION OF MATHEMATICAL FUNCTIONS
Pure functional language; Functional purity; Purely functional language; Purely functional programming language; Pure functional programming; Pure functional

Wikipédia

Algebraic Logic Functional programming language

Algebraic Logic Functional programming language, also known as ALF, is a programming language which combines functional and logic programming techniques. Its foundation is Horn clause logic with equality which consists of predicates and Horn clauses for logic programming, and functions and equations for functional programming.

ALF was designed to be genuine integration of both programming paradigms, and thus any functional expression can be used in a goal literal and arbitrary predicates can occur in conditions of equations. ALF's operational semantics is based on the resolution rule to solve literals and narrowing to evaluate functional expressions. In order to reduce the number of possible narrowing steps, a leftmost-innermost basic narrowing strategy is used which, it is claimed, can be efficiently implemented. Terms are simplified by rewriting before a narrowing step is applied and equations are rejected if the two sides have different constructors at the top. Rewriting and rejection are supposed to result in a large reduction of the search tree and produce an operational semantics that is more efficient than Prolog's resolution strategy. Similarly to Prolog, ALF uses a backtracking strategy corresponding to a depth-first search in the derivation tree.

The ALF system was designed to be an efficient implementation of the combination of resolution, narrowing, rewriting, and rejection. ALF programs are compiled into instructions of an abstract machine. The abstract machine is based on the Warren Abstract Machine (WAM) with several extensions to implement narrowing and rewriting. In the current ALF implementation programs of this abstract machine are executed by an emulator written in C.

In the Carnegie Mellon University Artificial Intelligence Repository, ALF is included as an AI programming language, in particular as a functional/logic programming language Prolog implementation. A user manual describing the language and the use of the system is available. The ALF System runs under Unix and is available under a custom proprietary software license that grants the right to use for "evaluation, research and teaching purposes" but not commercial or military use.